Markov Chain Intersections and the Loop-erased Walk
نویسندگان
چکیده
Let X and Y be independent transient Markov chains on the same state space that have the same transition probabilities. Let L denote the “loop-erased path” obtained from the path of X by erasing cycles when they are created. We prove that if the paths of X and Y have infinitely many intersections a.s., then L and Y also have infinitely many intersections a.s. §
منابع مشابه
Random Walk Problems Motivated by Statistical Physics
This paper is a an expanded version of a talk that I gave at the St. Petersburg summer school on probability and statistical physics in 2012. I discuss the state of research and open problems on three models that arise in equlibirum statistical physics: self-avoiding random walk, loop-erased random walk, and intersections of paths of simple random walks.
متن کاملThe loop - erased random walk and the uniform spanning tree on the four - dimensional discrete torus
Let x and y be points chosen uniformly at random from Z4n, the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order n(logn), resolving a conjecture of Benjamini and Kozma. We also show that the scaling limit of the uniform spanning tree on Z4n is the Brownian continuum random tree of Aldous. Our proofs use the techniq...
متن کاملHow to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
A general problem in computational probability theory is that of generating a random sample from the state space of a Markov chain in accordance with the steady-state probability law of the chain. Another problem is that of generating a random spanning tree of a graph or spanning arborescence of a directed graph in accordance with the uniform distribution, or more generally in accordance with a...
متن کاملSpectral dimension and random walks on the two dimensional uniform spanning tree
We study simple random walk on the uniform spanning tree on Z2. We obtain estimates for the transition probabilities of the random walk, the distance of the walk from its starting point after n steps, and exit times of both Euclidean balls and balls in the intrinsic graph metric. In particular, we prove that the spectral dimension of the uniform spanning tree on Z2 is 16/13 almost surely.
متن کاملUniform spanning forests and the bi-Laplacian Gaussian field
For N = n(log n) 1 4 , on the ball in Z4 with radius N we construct a ±1 spin model coupled with the wired spanning forests. We show that as n→∞ the spin field has bi-Laplacian Gaussian field on R4 as its scaling limit. For d ≥ 5, the model can be defined on Zd directly without the N -cutoff. The same scaling limit result holds. Our proof is based on Wilson’s algorithm and a fine analysis of in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001